Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size
نویسندگان
چکیده
This article studies the cardinality of perfect multi deletion binary codes. The lower bound for any code with fixed length and number deletions, asymptotic achievability Levenshtein's upper are shown.
منابع مشابه
On perfect deletion-correcting codes
In this article we present constructions for perfect deletion-correcting codes. The first construction uses perfect deletion-correcting codes without repetition of letters to construct other perfect deletion-correcting codes. This is a generalization of the construction shown in [1]. In the third section we investigate several constructions of perfect deletioncorrecting codes using designs. In ...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملAsymptotic Optimality of Certain Multi - Alternativesequential Tests
It is known that certain combinations of one-sided sequential probability ratio tests are asymptotically optimal (relative to the expected sample size) for problems involving a nite number of possible distributions when probabilities of errors tend to zero and observations are independent and identically distributed according to one of the underlying distributions. The objective of this paper i...
متن کاملSpectrum of Sizes for Perfect Deletion-Correcting Codes
One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius t with respect to the Levenshtĕın distance may be of different sizes. There is interest, therefore, in determining all possible sizes of a perfect t-deletion-correcting code, given the length n a...
متن کاملThe partial order of perfect codes associated to a perfect code
It is clarified whether or not “full rank perfect 1-error correcting binary codes act like primes in the family of all perfect 1-error correcting binary codes”. Thereby the well known connection between perfect 1-error correcting binary codes and tilings will be discussed and used.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3016261